Restricted permutations and queue jumping
نویسندگان
چکیده
منابع مشابه
Restricted permutations and queue jumping
A connection between permutations that avoid 4231 and a certain queueing discipline is established. It is proved that a more restrictive queueing discipline corresponds to avoiding both 4231 and 42513, and enumeration results for such permutations are given.
متن کاملSimple permutations and pattern restricted permutations
A simple permutation is one that does not map any non-trivial interval onto an interval. It is shown that, if the number of simple permutations in a pattern restricted class of permutations is finite, the class has an algebraic generating function and is defined by a finite set of restrictions. Some partial results on classes with an infinite number of simple permutations are given. Examples of...
متن کاملRestricted permutations
Restricted permutations are those constrained by having to avoid subsequences ordered in various prescribed ways. They have functioned as a convenient descriptor for several sets of permutations which arise naturally in combinatorics and computer science. We study the partial order on permutations (and more general sequences) that underlies the idea of restriction and which gives rise to sets o...
متن کاملRestricted Permutations and Polygons
Several authors have examined connections among restricted permutations and different combinatorial structures. In this paper we establish a bijection between the set of permutations π which avoid 1322 and the set of odd-dissection convex polygons, where a permutation avoids ab2c if there are no i < j < k − 1 such that πiπjπk is order-isomorphic to abc. We also exhibit bijections between the se...
متن کاملDyck paths and restricted permutations
This paper is devoted to characterize permutations with forbidden patterns by using canonical reduced decompositions, which leads to bijections between Dyck paths and Sn(321) and Sn(231), respectively. We also discuss permutations in Sn avoiding two patterns, one of length 3 and the other of length k. These permutations produce a kind of discrete continuity between the Motzkin and the Catalan n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2004
ISSN: 0012-365X
DOI: 10.1016/j.disc.2004.08.003